Multicolor list Ramsey numbers grow exponentially

نویسندگان

چکیده

The list Ramsey number R ℓ ( H , k ) ${R}_{\ell }(H,k)$ recently introduced by Alon, Bucić, Kalvari, Kuperwasser, and Szabó, is a list-coloring variant of the classical number. They showed that if $H$ fixed r $r$ -uniform hypergraph not -partite colors $k$ goes to infinity, e Ω ≤ O ${e}^{{\rm{\Omega }}(\sqrt{k})}\le {R}_{\ell }(H,k)\le {e}^{O(k)}$ . We prove = Θ }(H,k)={e}^{{\rm{\Theta }}(k)}$ only -partite.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Some Multicolor Ramsey Numbers

The Ramsey number R(G1, G2, G3) is the smallest positive integer n such that for all 3-colorings of the edges of Kn there is a monochromatic G1 in the first color, G2 in the second color, or G3 in the third color. We study the bounds on various 3-color Ramsey numbers R(G1, G2, G3), where Gi ∈ {K3,K3 + e,K4 − e,K4}. The minimal and maximal combinations of Gi’s correspond to the classical Ramsey ...

متن کامل

A bound for multicolor Ramsey numbers

The Ramsey number R(G1; G2; : : : ; Gn) is the smallest integer p such that for any n-edge coloring (E1; E2; : : : ; En) of Kp; Kp[Ei] contains Gi for some i, Gi as a subgraph in Kp[Ei]. Let R(m1; m2; : : : ; mn):=R(Km1 ; Km2 ; : : : ; Kmn); R(m; n):=R(m1; m2; : : : ; mn) if mi=m for i=1; 2; : : : ; n. A formula is obtained for R(G1; G2; : : : ; Gn). c © 2001 Elsevier Science B.V. All rights re...

متن کامل

Multicolor Ramsey Numbers for Paths and Cycles

For given graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, then it is always a monochromatic copy of some Gi, for 1 ≤ i ≤ k. We give a lower bound for k-color Ramsey number R(Cm, Cm, . . . , Cm), where m ≥ 8 is even and Cm is the cycle on m...

متن کامل

Multicolor Ramsey numbers for triple systems

Given an r-uniform hypergraph H, the multicolor Ramsey number rk(H) is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K n yields a monochromatic copy of H. We investigate rk(H) when k grows and H is fixed. For nontrivial 3-uniform hypergraphs H, the function rk(H) ranges from √ 6k(1 + o(1)) to double exponential in k. We observe that rk(H) is polynomi...

متن کامل

A Note on Two Multicolor Ramsey Numbers

Two new bounds for multicolor Ramsey numbers are proved: R(K3,K3, C4, C4) ≥ 27 and R4(C4) ≤ 19.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Theory

سال: 2022

ISSN: ['0364-9024', '1097-0118']

DOI: https://doi.org/10.1002/jgt.22832